|
In mathematics, a cyclic polytope, denoted ''C''(''n'',''d''), is a convex polytope formed as a convex hull of ''n'' distinct points on a rational normal curve in R''d'', where ''n'' is greater than ''d''. These polytopes were studied by Constantin Carathéodory, David Gale, Theodore Motzkin, Victor Klee, and others. They play an important role in polyhedral combinatorics: according to the upper bound theorem, proved by Peter McMullen and Richard Stanley, the boundary ''Δ''(''n'',''d'') of the cyclic polytope ''C''(''n'',''d'') maximizes the number ''f''''i'' of ''i''-dimensional faces among all simplicial spheres of dimension ''d'' − 1 with ''n'' vertices. == Definition == The moment curve in is defined by :. The -dimensional cyclic polytope with vertices is the convex hull : of distinct points with on the moment curve.〔 The combinatorial structure of this polytope is independent of the points chosen, and the resulting polytope has dimension ''d'' and ''n'' vertices.〔 Its boundary is a (''d'' − 1)-dimensional simplicial polytope denoted ''Δ''(''n'',''d''). 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Cyclic polytope」の詳細全文を読む スポンサード リンク
|